A compiler-driven supercomputer

A Compiler-driven Supercomputer

The overall prrformance of supercomputers is slow compared to the speed of their underlying logic technology. This discrepancy is due to several bottlenecks: memories are slower than the CPU, conditional jumps limit the usefulness of pipelining and pre-fetching mechanisms, and functional-unit parallelism is limited by the speed of hardware scheduling. This paper describes a supercomputer archit...

Compiler-Driven Reconfiguration of Multiprocessors

Multiprocessors enable parallel execution of a single large application to achieve a performance improvement. An application is split at instruction, data or task level (based on the granularity), such that the overhead of partitioning is minimal. Parallelization for multiprocessors is mostly restricted to a fixed granularity. Reconfiguration enables architectural variations to allow multiple g...

Automatic Profiler-driven Pr Obabilistic Compiler Optimization

We document the design and implementation of an extension to a compiler in the IBM XL family, to automatically use profiling information to enhance its optimizations. The novelty of this implementation is that the compiler and profiler are treated as two separate programs which communicate through a programmable interface rather than as one integrated system. We also present a new technique for...

Coverage-driven Automated Compiler Test Suite Generation

Compiler Driven Code Comments and Refactoring

Helping programmers write parallel software is an urgent problem given the popularity of multi-core architectures. Engineering compilers which automatically parallelize and vectorize code has turned out to be very challenging. Compilers are not powerful enough to exploit all opportunities for optimization in a code fragment – rather, they are selective with respect to the coding patterns they o...